A Sound Floating-Point Polyhedra Abstract Domain

نویسندگان

  • Liqian Chen
  • Antoine Miné
  • Patrick Cousot
چکیده

The polyhedra abstract domain is one of the most powerful and commonly used numerical abstract domains in the field of static program analysis based on abstract interpretation. In this paper, we present an implementation of the polyhedra domain using floating-point arithmetic without sacrificing soundness. Floating-point arithmetic allows a compact memory representation and an efficient implementation on current hardware, at the cost of some loss of precision due to rounding. Our domain is based on a constraint-only representation and employs sound floating-point variants of Fourier-Motzkin elimination and linear programming. The preliminary experimental results of our prototype are encouraging. To our knowledge, this is the first time that the polyhedra domain is adapted to floating-point arithmetic in a sound way.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational Analysis of Floating-Point Arithmetic

A set of abstract operations is given that allows the uniform analysis of integer and floating point arithmetic in the abstract domain of convex polyhedra. We show how to implement rounding faithfully and show that the modelling of rounding is necessary even for the analysis of integer variables. Different rounding modes occurring in floating point implementations are discussed and their implem...

متن کامل

An Abstract Domain to Discover Interval Linear Equalities

We introduce a new abstract domain, namely the domain of Interval Linear Equalities (itvLinEqs), which generalizes the affine equality domain with interval coefficients by leveraging results from interval linear algebra. The representation of itvLinEqs is based on a row echelon system of interval linear equalities, which natively allows expressing classical linear relations as well as certain t...

متن کامل

Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships

We introduce a new numerical abstract domain, so-called interval polyhedra (itvPol), to infer and propagate interval linear constraints over program variables. itvPol, which allows to represent constraints of the form ∑ k[ak, bk]xk ≤ c, is more expressive than the classic convex polyhedra domain and allows to express certain non-convex (even unconnected) properties. The implementation of itvPol...

متن کامل

Seminar: Aktuelle Themen aus der Theorie der Programmierung Numerical Domains A Practical Construction for Decomposing Numerical Abstract Domains

Domains Gagandeep Singh, Markus Püschel, Martin Vechev Numerical abstract domains such as Polyhedra, Octahedron, Octagon, Interval, and others are an essential component of static program analysis. The choice of domain offers a performance/precision tradeoff ranging from cheap and imprecise (Interval) to expensive and precise (Polyhedra). Recently, significant speedups were achieved for Octagon...

متن کامل

Weakly Relational Numerical Abstract Domains

Interpretation Abstract Interpretation: General theory of sound approximations of semantics [Cousot78]. Numerical Abstract Domain: • computer-representable set D of abstract values, together with: • a concretisation: γ: D → P(V → I), • a partial order: ⊑, ⊥, ⊤, • sound, effective abstract transfer functions {| I |}: ({| I |} ◦ γ)(X ) ⊆ (γ ◦ {| I |})(X ), a sound, effective abstract union ∪: γ(X...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008